Isogeometric Least-Squares Collocation Method with Consistency and Convergence Analysis
نویسندگان
چکیده
منابع مشابه
H2-Convergence of Least-Squares Kernel Collocation Methods
The strong-form asymmetric kernel-based collocation method, commonly referred to as the Kansa method, is easy to implement and hence is widely used for solving engineering problems and partial differential equations despite the lack of theoretical support. The simple leastsquares (LS) formulation, on the other hand, makes the study of its solvability and convergence rather nontrivial. In this p...
متن کاملLeast – Squares Method For Estimating Diffusion Coefficient
Abstract: Determination of the diffusion coefficient on the base of solution of a linear inverse problem of the parameter estimation using the Least-square method is presented in this research. For this propose a set of temperature measurements at a single sensor location inside the heat conducting body was considered. The corresponding direct problem was then solved by the application of the ...
متن کاملLEAST – SQUARES METHOD FOR ESTIMATING DIFFUSION COEFFICIENT
Determining the diffusion coefficient based on the solution of the linear inverse problem of the parameter estimation by using the Least-square method is presented. A set of temperature measurements at a single sensor location inside the heat conducting body is required. The corresponding direct problem will be solved by an application of the heat fundamental solution.
متن کاملRank based Least-squares Independent Component Analysis
In this paper, we propose a nonparametric rank-based alternative to the least-squares independent component analysis algorithm developed. The basic idea is to estimate the squared-loss mutual information, which used as the objective function of the algorithm, based on its copula density version. Therefore, no marginal densities have to be estimated. We provide empirical evaluation of th...
متن کاملAn Analysis of Weighted Least Squares Method and Layered Least Squares Method with the Basis Block Lower Triangular Matrix Form∗
In this paper, we analyze the limiting behavior of the weighted least squares problem minx∈<n Pp i=1 kDi(Aix − bi)k2, where each Di is a positive definite diagonal matrix. We consider the situation where the magnitude of the weights are drastically different block-wisely so that max(D1) ≥ min(D1) À max(D2) ≥ min(D2) À max(D3) ≥ . . . À max(Dp−1) ≥ min(Dp−1)À max(Dp). Here max(·) and min(·) repr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Systems Science and Complexity
سال: 2020
ISSN: 1009-6124,1559-7067
DOI: 10.1007/s11424-020-9052-9